Incremental maintenance of generalized association rules under taxonomy evolution

نویسندگان

  • Ming-Cheng Tseng
  • Wen-Yang Lin
  • Rong Jeng
چکیده

Mining association rules from large databases of business data is an important topic in data mining. In many applications, there are explicit or implicit taxonomies (hierarchies) for items, so it may be useful to find associations at levels of the taxonomy other than the primitive concept level. Previous work on the mining of generalized association rules, however, assumed that the taxonomy of items remained unchanged, disregarding the fact that the taxonomy might be updated as new transactions are added to the database over time. If this happens, effectively updating the generalized association rules to reflect the database change and related taxonomy evolution is a crucial task. In this paper, we examine this problem and propose two novel algorithms, called IDTE and IDTE2, which can incrementally update the generalized association rules when the taxonomy of items evolves as a result of new transactions. Empirical evaluations show that our algorithms can maintain their performance even for large numbers of incremental transactions and high degrees of taxonomy evolution, and are faster than applying contemporary generalized association mining algorithms to the whole updated database.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maintenance of Generalized Association Rules Under Transaction Update and Taxonomy Evolution

Mining generalized association rules among items in the presence of taxonomies has been recognized as an important model in data mining. Earlier work on mining generalized association rules ignore the fact that the taxonomies of items cannot be kept static while new transactions are continuously added into the original database. How to effectively update the discovered generalized association r...

متن کامل

Maintenance of Generalized Association Rules for Record Deletion Based on the Pre-Large Concept

In the past, we proposed an incremental mining algorithm for maintenance of generalized association rules as new transactions were inserted. Deletion of records in databases is, however, commonly seen in real-world applications. In this paper, we thus attempt to extend our previous approach to solve this issue. The proposed algorithm maintains generalized association rules based on the concept ...

متن کامل

Elastic/plastic Buckling Analysis of Skew Thin Plates based on Incremental and Deformation Theories of Plasticity using Generalized Differential Quadrature Method

Abstract   In this study, generalized differential quadrature analysis of elastic/plastic buckling of skew thin plates is presented. The governing equations are derived for the first time based on the incremental and deformation theories of plasticity and classical plate theory (CPT). The elastic/plastic behavior of plates is described by the Ramberg-Osgood model. The ranges of plate geometries...

متن کامل

Incremental Maintenance Of Association Rules Under Support Threshold Change

Maintenance of association rules is an interesting problem. Several incremental maintenance algorithms were proposed since the work of (Cheung et al, 1996). The majority of these algorithms maintain rule bases assuming that support threshold doesn't change. In this paper, we present incremental maintenance algorithm under support threshold change. This solution allows user to maintain its rule ...

متن کامل

Maintenance of Generalized Association Rules Based on Pre-large Concepts

Due to the increasing use of very large databases and data warehouses, mining useful information and helpful knowledge from transactions is evolving into an important research area. In the past, researchers usually assumed databases were static and items were on a single level to simplify data mining problems. Thus, most of algorithms proposed focused on a single level, and did not utilize prev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Information Science

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2008